Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
نویسندگان
چکیده
منابع مشابه
A Path Routing Algorithm for the Basic WK-Recursive Pyramid Networks
In routing, a source vertex sends a message to a target vertex and the routing algorithm decides a path from the source vertex to the target vertex. In 2013, Wang and Juan proposed a simple version of the WK-recursive pyramid networks, is called the basic WK-recursive pyramid network, which have received much attention recently. There are many literatures that study on this topology. This paper...
متن کاملHamiltonicity of the Pyramid Network with or without Fault
Sarbazi-Azad, Ould-Khaoua, and Mackenzie proved in 2001 that there exists a Hamiltonian cycle in a pyramid network and they also constructed a Hamiltonian path between apex and each of 4 frontiers of a pyramid network. The fault tolerance is a crucial matter for parallel computing, especially in a large network. This work improves Sarbazi-Azad et al.’s result and considers other relative proble...
متن کاملthe evaluation of language related engagment and task related engagment with the purpose of investigating the effect of metatalk and task typology
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
15 صفحه اولAdaptive Broadcasting with Faulty Nodes
We consider broadcasting from a fault-free source to all nodes of a completely connected n-node network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packets. Faulty nodes can receive information but cannot send it. Broadcasting is adaptive, i.e. a node...
متن کاملSpanning Connectivity of the WK-Recursive Networks
A k-container C(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k∗-container if it contains all vertices of G. A graph G is k∗connected if there exists a k∗-container between any two distinct vertices. The spanning connectivity of G, κ∗(G), is defined to be the largest integer k such that G is w∗-connected for all 1 ≤ w ≤ k if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.10.034